Priority Arguments via True stages
نویسنده
چکیده
We describe a variation of Ash’s η-system, and give a new proof of Ash’s metatheorem. As an application, we prove a generalization of Ash and Knight’s theorem on pairs of structures.
منابع مشابه
Iterated trees of strategies and priority arguments
0. Introduction. It is our intent, in this paper, to try to describe some of the key ideas developed in the series or papers by Lempp and Lerman [LL1, LL2, LL3, LL4], which use the iterated trees of strategies approach to priority arguments. This is an approach which provides a framework for carrying out priority arguments at all levels of the arithmetical hierarchy. The first attempt to find a...
متن کاملPriority Arguments and Epsilon Substitutions
While the priority argument has been one of the main techniques of recursion theory, it has seen only a few applications to other areas of mathematics [Mar75, Sol84]. One possibility for another such application was pointed out by Kreisel: Hilbert’s ǫsubstitution method, a technique for proving the 1-consistency of theories. Kreisel’s observation was that the proof that the method works [Ack40]...
متن کاملPriority Inheritance: The Real Story
A recent whitepaper by Victor Yodaiken presents a sequence of highly technical arguments regarding the implementability and use of priority inheritance, followed by a set of conclusions. The technical arguments in the paper are not new, are generally correct, and have been widely discussed in the real-time research community for many years. However, the conclusions drawn in the paper are badly ...
متن کاملPriority Arguments Using Iterated Trees of Strategies
A general framework for priority arguments in classical recursion theory, using iterated trees of strategies, is introduced and used to present new proofs of four fundamental theorems of recursion theory.
متن کاملPartition Arguments in Multiparty Communication Complexity
Consider the “Number in Hand” multiparty communication complexity model, where k players holding inputs x1, . . . , xk ∈ {0, 1} communicate to compute the value f(x1, . . . , xk) of a function f known to all of them. The main lower bound technique for the communication complexity of such problems is that of partition arguments: partition the k players into two disjoint sets of players and find ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 79 شماره
صفحات -
تاریخ انتشار 2014